Technical Note—Rationalizing Discrete Programs

Discrete relaxations of combinatorial programs

This paper investigates a technique of building up discrete relaxations of combi natorial optimization problems. To establish such a relaxation we introduce a transformation technique —aggregation— that allows one to relax an integer program by means of another integer program. We show that knapsack and set packing relaxations give rise to combinatorial cutting planes in a simple and straightfo...

TECHNICAL APPENDIX: Optimal Welfare-to-Work Programs

Modeling and Simulation of Modern Industrial Screens using Discrete Element Method (TECHNICAL NOTE)

With progress in mineral processing technologies, particle size classification equipment has also been changed to satisfy the needs of modern plants. Accordingly, design, manufacturing and utilizing of banana screens in mineral processing plants have led to increased screening efficiency at industrial scale. Banana screen is an important invention occurred in past decade which increases screeni...

top web preservation programs’ solutions in facing technical challenges

objective: the present study aims to verify web preservation projects and programs in order to explore their preferred solutions in tackling the technical challenges.   method: a documentary method was used to identify and analyze web-preservation-related literature, including papers, handbooks, web sites and documents. the programs’ persons in charge were also questioned. besides, top web pres...

From Speciications to Programs { an Extrinsic Approach (technical Report)

A methodology for deriving programs from speci cations of observable behaviour is described. The class of processes to which this methodology is applicable includes those whose state changes are fully de nable by labelled transition systems, for example communicating processes without internal state changes. A logic program representation of such labelled transition systems is proposed, interpr...